package Test;

import Algorithm.traversalTree;
import Application.Stack_computePostfix;
import Application.Stack_infix2postfix;
import Application.Stack_postfix2expressionTree;
import DataStructure.Node;

public class TestTraversalExpressionTree {
	public static void main(String [] args){
		//String expression = "a+b*c+(d*e+f)*g";
		//String expression = "1+1*4+(1*4+1)*1";
		String expression = "abc*+de*f+g*+";
		Node<String> result = Stack_postfix2expressionTree.getTreeExpression(expression);
		traversalTree.preorderTraversal(result);
		System.out.println();
		
		//traversalTree.inorderTraversal(result);
		//System.out.println();
		traversalTree.postorderTraversal(result);
	}
}
